New Topological Structure related from Digraph
نویسندگان
چکیده
This work introduces a novel topological constraint called the intopological digraph space imposed by subbasis ... contains one vertice such that edge ẹ is indegree of it and investigates some properties this structure. Our objective to provide crucial first step in study characteristics digraphs utilizing appropriate topology.
منابع مشابه
Digraph related constructions and the complexity of digraph homomorphism problems
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic constructions. As applications we observe a collapse in the applicability of algorithms for CSPs over directed graphs with both a total source and a total sink: the c...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملStreaming Algorithm for Determining a Topological Ordering of a Digraph
Finding a topological ordering for a directed graph is one of the fundamental problems in computer science. Several textbook-standard algorithms using linear memory have been discovered and utilized to solve several other problems for many decades, especially in resolving dependencies and solving other graph connectivity problems. However, these algorithms are becoming less practical nowadays a...
متن کاملOn the structure of the adjacency matrix of the line digraph of a regular digraph
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-ones matrix of dimension d with the identity matrix of dimension n and the matrix B is the direct sum of the adjacency matrices of the factors in a dicycle factorization of D.
متن کاملDigraph Decompositions and Monotonicity in Digraph Searching
We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Earthline Journal of Mathematical Sciences
سال: 2022
ISSN: ['2581-8147']
DOI: https://doi.org/10.34198/ejms.11223.303316